Fast Fixed-Parameter Tractable Algorithms for Nontrivial Generalizations of Vertex Cover
نویسندگان
چکیده
Our goal in this paper is the development of fast algorithms for recognizing general classes of graphs. We seek algorithms whose complexity can be expressed as a linear function of the graph size plus an exponential function of k, a natural parameter describing the class. In particular, we consider the class Wk(G), where for each graph G in Wk(G), the removal of a set of at most k vertices from G results in a graph in the base graph class G. (If G is the class of edgeless graphs, Wk(G) is the class of graphs with bounded vertex cover.) When G is a minor-closed class such that each graph in G has bounded maximum degree, and all obstructions of G (minor-minimal graphs outside G) are connected, we obtain an O((g + k)|V (G)| + (fk)k) recognition algorithm for Wk(G), where g and f are constants (modest and quantified) depending on the class G. If G is the class of graphs with maximum degree bounded by D (not closed under minors), we can still obtain a running time of O(|V (G)|(D + k) + k(D + k)k+3) for recognition of graphs in Wk(G). Our results are obtained by considering minor-closed classes for which all obstructions are connected graphs, and showing that the size of any obstruction for Wk(G) is O(tk7 + t7k2), where t is a bound on the size of obstructions for G. A trivial corollary of this result is an upper bound of (k + 1)(k + 2) on the number of vertices in any obstruction of the class of graphs with vertex cover of size at most k. These results are of independent graph-theoretic interest. ∗Reserach supported by the Natural Sciences and Engineering Research Council of Canada, Ministry of Education and Culture of Spain (grant number MEC-DGES SB98 0K148809), and EU project ALCOM-FT (IST-9914186). †Department of Computer Science, University of Waterloo, Waterloo, Ontario, Canada, N2L 3G1. ‡Departament de Llenguatges i Sistemes Informàtics, Universitat Politècnica de Catalunya, Campus Nord, Mòdul C5, c/Jordi Girona Salgado, 1-3. E-08034, Barcelona, Spain.
منابع مشابه
Exact Algorithms for Generalizations of Vertex Cover
The NP-complete Vertex Cover problem has been intensively studied in the field of parameterized complexity theory. However, there exists only little work concerning important generalizations of Vertex Cover like Partial Vertex Cover, Connected Vertex Cover, and Capacitated Vertex Cover which are of high interest in theory as well as in real-world applications. So far research was mainly focused...
متن کاملParameterized Complexity of Generalized Vertex Cover Problems
Important generalizations of the Vertex Cover problem (Connected Vertex Cover,Capacitated Vertex Cover, andMaximum Partial Vertex Cover) have been intensively studied in terms of approximability. However, their parameterized complexity has so far been completely open. We close this gap here by showing that, with the size of the desired vertex cover as parameter, Connected Vertex Cover and Capac...
متن کاملOn Efficient Fixed Parameter Algorithms for WEIGHTED VERTEX COVER
We investigate the fixed parameter complexity of one of the most popular problems in combinatorial optimization, Weighted Vertex Cover. Given a graph G = (V, E), a weight function ω : V → R, and k ∈ R, Weighted Vertex Cover (WVC for short) asks for a subset C of vertices in V of weight at most k such that every edge of G has at least one endpoint in C. WVC and its variants have all been shown t...
متن کاملImprovement on vertex cover for low-degree graphs
The Vertex Cover problem (given a graph G and an integer k, decide if G has a vertex cover of k vertices) is one of the six “basic” NP-complete problems according to Garey and Johnson [7]. It is fixed-parameter tractable in terms of Downey and Fellows [5], that is, it can be solved in time O(f(k)n), where f is a function of the parameter k but independent of the input length n and c is a consta...
متن کاملExperimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs
Many NP-complete problems on planar graphs are “fixed-parameter tractable:” Recent theoretical work provided tree decomposition based fixed-parameter algorithms exactly solving various parameterized problems on planar graphs, among others Vertex Cover, in time O(c √ kn). Here, c is some constant depending on the graph problem to be solved, n is the number of graph vertices, and k is the problem...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Applied Mathematics
دوره 152 شماره
صفحات -
تاریخ انتشار 2001